Proof Theory for Positive Logic with Weak Negation
نویسندگان
چکیده
منابع مشابه
Proof Nets with Explicit Negation for Multiplicative Linear Logic
Multiplicative linear logic (MLL) was introduced in Gi87] as a one-sided sequent calculus: linear negation is a notion that is deened, via De Morgan identities. One obtains proof nets for MLL by identifying derivations in the one-sided calculus that are equal up to a permutation of inference rules. In this paper we consider a similar quotient for the formulation of MLL as a two-sided sequent ca...
متن کاملProof theory for modal logic
The axiomatic presentation of modal systems and the standard formulations of natural deduction and sequent calculus for modal logic are reviewed, together with the difficulties that emerge with these approaches. Generalizations of standard proof systems are then presented. These include, among others, display calculi, hypersequents, and labelled systems, with the latter surveyed from a closer p...
متن کاملIndependence friendly logic with classical negation via flattening is a second-order logic with weak dependencies
It is well-known that Independence Friendly (IF) logic is equivalent to existential second-order logic (Σ1) and, therefore, is not closed under classical negation. The Boolean closure of IF sentences, called Extended IF-logic, on the other hand, corresponds to a proper fragment of ∆2. In this article we consider SL(↓), IF-logic extended with Hodges’ flattening operator ↓, which allows to define...
متن کاملNegation and Proof by Contradiction in Access-Limited Logic
Access-Limited Logic (ALL) is a language for knowledge representation which formalizes the access limitations inherent in a network structured knowledge-base. Where a deductive method such as resolution would retrieve all assertions that satisfy a given pattern, an access-limited logic retrieves all assertions reachable by following an available access path. In this paper, we extend previous wo...
متن کاملA Simpler Proof Theory for Nominal Logic
Nominal logic is a variant of first-order logic which provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Logica
سال: 2019
ISSN: 0039-3215,1572-8730
DOI: 10.1007/s11225-019-09869-y